The Bounded Bayesian
نویسنده
چکیده
The ideal Bayesian agent reasons from a global probability model, but real agents are restricted to simplified models which they know to be adequate only in restricted circumstances. Very little formal theory has been developed to help fallibly rational agents manage the process of constructing and revising small world models. The goal of this paper is to present a theoretical framework for analyzing model management approaches. For a probability forecasting problem, a search process over small world models is analyzed as an approximation to a larger-world model which the agent cannot explicitly enumerate or compute. Conditions are given under which the sequence of small-world models converges to the larger-world
منابع مشابه
Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number
Both learning and inference tasks on Bayesian networks are NP-hard in general. Bounded tree-width Bayesian networks have recently received a lot of attention as a way to circumvent this complexity issue; however, while inference on bounded tree-width networks is tractable, the learning problem remains NP-hard even for tree-width 2. In this paper, we propose bounded vertex cover number Bayesian ...
متن کاملLearning in Bayesian Games by Bounded Rational Players Ii: Nonmyopia
We generalize results of earlier work on learning in Bayesian games by allowing players to make decisions in a nonmyopic fashion. In particular, we address the issue of nonmyopic Bayesian learning with an arbitrary number of bounded rational players, i.e., players who choose approximate best-response strategies for the entire horizon (rather than the current period). We show that, by repetition...
متن کاملBayesian Network Automata for Modelling Unbounded Structures
This paper proposes a framework which unifies graphical model theory and formal language theory through automata theory. Specifically, we propose Bayesian Network Automata (BNAs) as a formal framework for specifying graphical models of arbitrarily large structures, or equivalently, specifying probabilistic grammars in terms of graphical models. BNAs use a formal automaton to specify how to cons...
متن کاملStability evaluation of Neural and statistical Classifiers based on Modified Semi - bounded Plug - in Algorithm
This paper illustrates a new criterion for evaluating neural networks stability compared to the Bayesian classifier. The stability comparison is performed by the error rate probability densities estimation using the modified semi-bounded Plug-in algorithm. We attempt, in this work, to demonstrate that the Bayesian approach for neural networks improves the performance and stability degree of the...
متن کاملLearning in Bayesian Games by Bounded Rational Players I
We study learning in Bayesian games (or games with differential information) with an arbitrary number of bounded rational players, i.e., players who choose approximate best response strategies [approximate Bayesian Nash Equilibrium (BNE) strategies] and who also are allowed to be completely irrational in some states of the world. We show that bounded rational players by repetition can reach a l...
متن کاملLearning Treewidth-Bounded Bayesian Networks with Thousands of Variables
We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian network greatly reduces the complexity of inferences. Yet, being a global property of the graph, it considerably increases the difficulty of the learning process. Our novel algorithm accomplishes this task, scaling both to large domains and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992